Pyramid Computer Solutions of the Closest Pair Problem
نویسنده
چکیده
Given an N x N array of OS and Is, the closest pair problem is to determine the minimum distance between any pair of ones. Let D be this minimum distance (or D = 2N if there are fewer than two Is). Two solutions to this problem are given, one requiring O(log( N) + D) time and the other O(log( N)). These solutions are for two types of parallel computers arranged in a pyramid fashion with the base of the pyramid containing the matrix. The results improve upon an algorithm of Dyer that requires o(N) time on a more pOWerfd COmpUter.
منابع مشابه
EMCSO: An Elitist Multi-Objective Cat Swarm Optimization
This paper introduces a novel multi-objective evolutionary algorithm based on cat swarm optimizationalgorithm (EMCSO) and its application to solve a multi-objective knapsack problem. The multi-objective optimizers try to find the closest solutions to true Pareto front (POF) where it will be achieved by finding the less-crowded non-dominated solutions. The proposed method applies cat swarm optim...
متن کاملEfficient Parallel Solutions to Some Geometric Problems
This paper presents new algorithms for solving some geometric problems on a shared memory parallel computer j where concurrent reads are allowed but no two processors can simultaneously attempt to write in the same memory location. The algorithms are quite different from known sequential algorithms, and are based on the use of a new parallel divide-and-conquer technique. One of our results is a...
متن کاملBounds for the dimension of the $c$-nilpotent multiplier of a pair of Lie algebras
In this paper, we study the Neumann boundary value problem of a class of nonlinear divergence type diffusion equations. By a priori estimates, difference and variation techniques, we establish the existence and uniqueness of weak solutions of this problem.
متن کاملOptimum Partition Parameter of Divide-and-Conquer Algorithm for Solving Closest-Pair Problem
Divide and Conquer is a well known algorithmic procedure for solving many kinds of problem. In this procedure, the problem is partitioned into two parts until the problem is trivially solvable. Finding the distance of the closest pair is an interesting topic in computer science. With divide and conquer algorithm we can solve closest pair problem. Here also the problem is partitioned into two pa...
متن کاملParallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers
This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Algorithms
دوره 6 شماره
صفحات -
تاریخ انتشار 1985